Distance-Sensitive Bloom Filters
نویسندگان
چکیده
A Bloom filter is a space-efficient data structure that answers set membership queries with some chance of a false positive. We introduce the problem of designing generalizations of Bloom filters designed to answer queries of the form, “Is x close to an element of S?” where closeness is measured under a suitable metric. Such a data structure would have several natural applications in networking and database applications. We demonstrate how appropriate data structures can be designed using locality-sensitive hash functions as a building block, and we specifically analyze the performance of a natural scheme under the Hamming metric.
منابع مشابه
Distance Sensitive Bloom Filters Without False Negatives
A Bloom filter is a widely used data-structure for representing a set S and answering queries of the form “Is x in S?”. By allowing some false positive answers (saying ‘yes’ when the answer is in fact ‘no’) Bloom filters use space significantly below what is required for storing S. In the distance sensitive setting we work with a set S of (Hamming) vectors and seek a data structure that offers ...
متن کاملEfficient Cryptanalysis of Bloom Filters for Privacy-Preserving Record Linkage
Privacy-preserving record linkage (PPRL) is the process of identifying records that represent the same entity across databases held by different organizations without revealing any sensitive information about these entities. A popular technique used in PPRL is Bloom filter encoding, which has shown to be an efficient and effective way to encode sensitive information into bit vectors while still...
متن کاملPublic-Key Encrypted Bloom Filters with Applications to Supply Chain Integrity
Bloom filters provide a spaceand time-efficient mean to check the inclusion of an element in a set. In some applications it is beneficial, if the set represented by the Bloom filter is only revealed to authorized parties. Particularly, operations data in supply chain management can be very sensitive and Bloom filters can be applied to supply chain integrity validation. Despite the protection of...
متن کاملIdentification with encrypted biometric data
Biometrics make human identification possible with a sample of a bio-metric trait and an associated database. Classical identification tech-niques lead to privacy concerns. This paper introduces a new method toidentify someone using his biometrics in an encrypted way.Our construction combines Bloom Filters with Storage and Locality-Sensitive Hashing. We apply this error-...
متن کاملRouting on large scale mobile ad hoc networks using bloom filters
A bloom filter is a probabilistic data structure used to test whether an element is a member of a set. The bloom filter shares some similarities to a standard hash table but has a higher storage efficiency. As a drawback, bloom filters allow the existence of false positives. These properties make bloom filters a suitable candidate for storing topological information in large-scale mobile ad hoc...
متن کامل